Gaps between Fractional Parts, and Additive Combinatorics
نویسندگان
چکیده
We give bounds on the number of distinct differences Na − a as a varies over all elements of a given finite set A ⊆ (R/Z)d, d ≥ 1, and Na is a nearest neighbour to a.
منابع مشابه
Nil-bohr Sets of Integers
We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr sets are fundamentally abelian in nature and are linked to Fourier analysis. Recently it has become apparent that a higher order, nonabelian, Fourier analys...
متن کاملMultilinear Singular Operators with Fractional Rank
We prove bounds for multilinear operators on R given by multipliers which are singular along a k dimensional subspace. The new case of interest is when the rank k/d is not an integer. Connections with the concept of true complexity from Additive Combinatorics are also investigated.
متن کاملAdditive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define – perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which are used there. One might say that additive combinatorics is a branch of mathematics concerning the study of additive structures in sets equipped with a grou...
متن کاملAdditive Combinatorics and its Applications in Theoretical Computer Science
Additive combinatorics (or perhaps more accurately, arithmetic combinatorics) is a branch of mathematics which lies at the intersection of combinatorics, number theory, Fourier analysis and ergodic theory. It studies approximate notions of various algebraic structures, such as vector spaces or fields. In recent years, several connections between additive combinatorics and theoretical computer s...
متن کاملAdditive Combinatorics and Theoretical Computer Science ∗ Luca Trevisan
Additive combinatorics is the branch of combinatorics where the objects of study are subsets of the integers or of other abelian groups, and one is interested in properties and patterns that can be expressed in terms of linear equations. More generally, arithmetic combinatorics deals with properties and patterns that can be expressed via additions and multiplications. In the past ten years, add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015